Categoricity Properties for Computable Algebraic Fields
نویسندگان
چکیده
We examine categoricity issues for computable algebraic fields. Such fields behave nicely for computable dimension: we show that they cannot have finite computable dimension greater than 1. However, they behave less nicely with regard to relative computable categoricity: we give a structural criterion for relative computable categoricity of these fields, and use it to construct a field that is computably categorical, but not relatively computably categorical. Finally, we show that computable categoricity for this class of fields is Π4-complete.
منابع مشابه
Logic Seminar Fall 2010 Title: Algebraic Fields and Computable Categoricity
The rubric of trees is most commonly appealed to when proving theorems about Turing degrees, yet trees can also be useful when considering constructions on recursively enumerable (r.e.) sets. In this talk I will investigate the use of twodimensional trees in such constructions. A simple example which serves as a model for more complex arguments is the Freidberg Splitting Theorem which states th...
متن کاملComputable Categoricity for Algebraic Fields with Splitting Algorithms
A computably presented algebraic field F has a splitting algorithm if it is decidable which polynomials in F [X] are irreducible there. We prove that such a field is computably categorical iff it is decidable which pairs of elements of F belong to the same orbit under automorphisms. We also show that this criterion is equivalent to the relative computable categoricity of F .
متن کاملD-computable Categoricity for Algebraic Fields
We use the Low Basis Theorem of Jockusch and Soare to show that all computable algebraic fields are d-computably categorical for a particular Turing degree d with d′ = 0′′, but that not all such fields are 0′-computably categorical. We also prove related results about algebraic fields with splitting algorithms, and fields of finite transcendence degree over Q.
متن کاملIsomorphism and Classification for Countable Structures
We introduce a topology on the space of all isomorphism types represented in a given class of countable models, and use this topology as an aid in classifying the isomorphism types. This mixes ideas from effective descriptive set theory and computable structure theory, extending concepts from the latter beyond computable structures to examine the isomorphism problem on arbitrary countable struc...
متن کاملComputable Categoricity versus Relative Computable Categoricity
We study the notion of computable categoricity of computable structures, comparing it especially to the notion of relative computable categoricity and its relativizations. We show that every 1-decidable computably categorical structure is relatively ∆2-categorical. We study the complexity of various index sets associated with computable categoricity and relative computable categoricity. We also...
متن کامل